On upper bounds for total k-domination number via the probabilistic method
نویسندگان
چکیده
منابع مشابه
Lower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملUpper Bounds on the Total Domination Number
A total dominating set of a graph G with no isolated vertex is a set S of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set in G. In this paper, we present several upper bounds on the total domination number in terms of the minimum degree, diameter, girth and order.
متن کاملImproved upper bounds for the k-tuple domination number
We improve the generalized upper bound for the k-tuple domination number given in [A. Gagarin and V.E. Zverovich, A generalized upper bound for the k-tuple domination number, Discrete Math. 308 no. 5–6 (2008), 880–885]. Precisely, we show that for any graph G, when k = 3, or k = 4 and d ≤ 3.2, γ×k(G) ≤ ln(δ−k + 2) + ln ( (k − 2)d + ∑k−2 m=2 (k−m) 4min{m, k−2−m} d̂m + d̂k−1 ) + 1 δ − k + 2 n, and,...
متن کاملThe probabilistic method for upper bounds in domination theory
Domination is a rapidly developing area of research in graph theory, and its various applications to ad hoc networks, distributed computing, social networks and web graphs partly explain the increased interest. This thesis focuses on domination theory, and the main aim of the study is to apply a probabilistic approach to obtain new upper bounds for various domination parameters. Chapters 2 and ...
متن کاملUpper bounds on the paired-domination number
A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and the subgraph induced by S contains a perfect matching. The minimum cardinality of a paired-dominating set of G is the paireddomination number of G, denoted by γpr (G). In this work, we present several upper bounds on the paired-domination number in terms of the maximum degre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kybernetika
سال: 2023
ISSN: ['1805-949X', '0023-5954']
DOI: https://doi.org/10.14736/kyb-2023-4-0537